Parameter Identification Algorithms for Minimum Variance Control
نویسندگان
چکیده
منابع مشابه
Minimum variance capacity identification
In the framework of multi-criteria decision making whose aggregation process is based on the Choquet integral, we present a maximum entropy like method enabling to determine, if it exists, the “least specific” capacity compatible with the initial preferences of the decision maker. The proposed approach consists in solving a strictly convex quadratic program whose objective function is equivalen...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملFast algorithms for least-squares-based minimum variance spectral estimation
The minimum variance (MV) spectral estimator is a robust high-resolution frequencydomain analysis tool for short data records. The traditional formulation of the minimum variance spectral estimation (MVSE) depends on the inverse of a Toeplitz autocorrelation matrix, for which a fast computational algorithm exists that exploits this structure. This paper extends the MVSE approach to two data-onl...
متن کاملFixed Parameter Algorithms for the Minimum Weight Triangulation Problem
The original version of this paper was published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006. This is an extended version published on February 20, 2006. We discuss and compare four fixed parameter algorithms for finding the minimum weight triangulation of a simple polygon with (n− k) vertices on the perimeter and k vertice...
متن کاملA Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k − 1 to k with at most p new edges is fixed-parameter tractable parameterized ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1983
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.19.889